New rapidly convergent series representations for $\zeta (2n+1)$
نویسندگان
چکیده
منابع مشابه
Rapidly Convergent Series for the Weierstrass Zeta-function and the Kronecker Function
We present expressions for the Weierstrass zeta-function and related elliptic functions by rapidly convergent series. These series arise as triple products in the A∞-category of an elliptic curve. 1. Formulas In this section we derive our formulas by classical means. In the next section we’ll explain how one can guess these formulas from the computation of certain triple products on elliptic cu...
متن کاملRapidly-Converging Series Representations of aMutual-Information Integral
This paper evaluates a mutual-information integral that appears in EXIT-chart analysis and the capacity equation for the binaryinput AWGN channel. Rapidly-converging series representations are derived and shown to be computationally efficient. Over a wide range of channel signal-to-noise ratios, the series are more accurate than the Gauss-Hermite quadrature and comparable to Monte Carlo integra...
متن کاملA Rapidly Convergent Descent Method for Minimization
27 information is used. A choice then has to be made as to which is the most eecient option. Acknowledgments. We are grateful to the referees for their useful comments. We thank Robert Michael Lewis for his valuable suggestions on how best to present this material, particularly the results given in x7. Mathematical models for the predictive value of early CA125 serum levels in epithelial ovaria...
متن کاملA rapidly convergent descent method for minimization
We are concerned in this paper with the general problem of finding an unrestricted local minimum of a function J[xu x2 • • •, xn) of several variables xx, x2, • •., xn. We suppose that the function of interest can be calculated at all points. It is convenient to group functions into two main classes according to whether the gradient vector g, = Wbx, is defined analytically at each point or must...
متن کاملA Very Rapidly Convergent Product Expansion For
There has recently been considerable interest in an essentially quadratic method for computing n. The algorithm, first suggested by Salamin [6], is based upon an identity known to Gauss [-3, p. 377], [4]. This iteration has been used by two Japanese researchers, Y. Tamura and Y. Kanada, to compute 223 decimal digits of n in under 7 hours. They have now successfully computed 224 digits (more tha...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 1997
ISSN: 0002-9939,1088-6826
DOI: 10.1090/s0002-9939-97-03795-7